Solving Linear Programming Problems on the Parallel Virtual Machine Environment
نویسندگان
چکیده
منابع مشابه
SOLVING FUZZY LINEAR PROGRAMMING PROBLEMS WITH LINEAR MEMBERSHIP FUNCTIONS-REVISITED
Recently, Gasimov and Yenilmez proposed an approach for solving two kinds of fuzzy linear programming (FLP) problems. Through the approach, each FLP problem is first defuzzified into an equivalent crisp problem which is non-linear and even non-convex. Then, the crisp problem is solved by the use of the modified subgradient method. In this paper we will have another look at the earlier defuzzifi...
متن کاملSolving multiobjective linear programming problems using ball center of polytopes
Here, we aim to develop a new algorithm for solving a multiobjective linear programming problem. The algorithm is to obtain a solution which approximately meets the decision maker's preferences. It is proved that the proposed algorithm always converges to a weak efficient solution and at times converges to an efficient solution. Numerical examples and a simulation study are used to illu...
متن کاملA NOTE ON THE ZIMMERMANN METHOD FOR SOLVING FUZZY LINEAR PROGRAMMING PROBLEMS
There are several methods for solving fuzzy linear programming (FLP)problems. When the constraints and/or the objective function are fuzzy, the methodsproposed by Zimmermann, Verdegay, Chanas and Werners are used more often thanthe others. In the Zimmerman method (ZM) the main objective function cx is addedto the constraints as a fuzzy goal and the corresponding linear programming (LP)problem w...
متن کاملOn solving stochastic linear programming problems
Solving a stochastic linear programming (SLP) problem involves selecting an SLP solver, transmitting the model data to the solver and retrieving and interpreting the results. After shortly introducing the SLP model classes in the first part of the paper we give a general discussion of these various facets of solving SLP problems. The second part consists of an overview on the model–solver conne...
متن کاملOn Solving Linear Fractional Programming Problems
A new method namely, denominator objective restriction method based on simplex method is proposed for solving linear fractional programming problems. Further, another method namely, decomposition-restriction method based on decomposition principle and the denominator objective restriction method is proposed for obtaining an optimal fuzzy solution to the fully fuzzy linear fractional programming...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: American Journal of Applied Sciences
سال: 2004
ISSN: 1546-9239
DOI: 10.3844/ajassp.2004.90.94